Free semiring-representations and nondeterminism
نویسندگان
چکیده
منابع مشابه
compactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولThe Structure of the One-Generated Free Domain Semiring
This note gives an explicit construction of the one-generated free domain semiring. In particular it is proved that the elements can be represented uniquely by finite antichains in the poset of finite strictly decreasing sequences of nonnegative integers. It is also shown that this domain semiring can be represented by sets of binary relations with union, composition and relational domain as op...
متن کاملMatroid Representations and Free Arrangements
We show that Terao's Conjecture ("Freeness of the module of logarithmic forms at a hyperplane arrangement is determined by its abstract matroid") holds over fields with at most four elements. However, an example demonstrates that the field characteristic has to be fixed for this. 1. Free arrangements The present study continues an investigation of the connection between algebraic and combinator...
متن کاملSemiring Neighbours
In 1996 Zhou and Hansen proposed a first-order interval logic called Neighbourhood Logic (NL) for specifying liveness and fairness of computing systems and also defining notions of real analysis in terms of expanding modalities. After that, Roy and Zhou presented a sound and relatively complete Duration Calculus as an extension of NL. We present an embedding of NL into an idempotent semiring of...
متن کاملQuantum Randomness and Nondeterminism
Does the notion of a quantum randomized or nondeterministic algorithm make sense, and if so, does quantum randomness or nonde-terminism add power? Although reasonable quantum random sources do not add computational power, the discussion of quantum random-ness naturally leads to several deenitions of the complexity of quantum states. Unlike classical string complexity, both deterministic and non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1985
ISSN: 0022-0000
DOI: 10.1016/0022-0000(85)90049-2